On convexity and monotonicity in generalized aggregative games
نویسندگان
چکیده
منابع مشابه
Monotonicity, convexity, and inequalities for the generalized elliptic integrals
We provide the monotonicity and convexity properties and sharp bounds for the generalized elliptic integrals [Formula: see text] and [Formula: see text] depending on a parameter [Formula: see text], which contains an earlier result in the particular case [Formula: see text].
متن کاملMonotonicity , Convexity and Symmetric Derivates
If the first lower symmetric derívate of a continuous function is nonnegative, then it is nondecreasing. If the second lower symmetric derívate of a continuous function is nonnegative, then it is convex. In this paper it is shown that if continuity is replaced by Baire one, Darboux in each of these, then the resulting statements are true.
متن کاملOn Nonparametric Tests of Positivity / Monotonicity / Convexity
We consider the problem of estimating the distance from an unknown signal, observed in a white-noise model, to convex cones of positive/monotone/convex functions. We show that, when the unknown function belongs to a Hölder class, the risk of estimating the Lr -distance, 1 ≤ r < ∞, from the signal to a cone is essentially the same (up to a logarithmic factor) as that of estimating the signal its...
متن کاملAggregative Games with Entry1
Aggregative games are used to model strategic interaction in many elds of economics, including industrial organization, political economy, international trade, and public nance. In such games, each players payo¤ depends on his/her own actions and an aggregate of all players actions. Examples in industrial organization are the Cournot oligopoly model, logit and CES di¤erentiated products Ber...
متن کاملLocal Aggregative Games
Aggregative games provide a rich abstraction to model strategic multi-agent interactions. We introduce local aggregative games, where the payoff of each player is a function of its own action and the aggregate behavior of its neighbors in a connected digraph. We show the existence of pure strategy -Nash equilibrium in such games when the payoff functions are convex or sub-modular. We prove an i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.2011